Constructive system for automatic program synthesis

A Grid-based Ant Colony System for Automatic Program Synthesis

The Ant Colony Metaheuristic was originally proposed for tackling optimization problems. More recent research has suggested that it can be applied for automatic generation of programs. By allowing the artificial ants to visit functions and terminals nodes, they become able to build pheromone trails that represent computer programs for optimizing a fitness domain-specific function. In this paper...

Automatic program synthesis via synthesis

Work on theorem-proving-based automatic program synthesis (see Lee, e t ai.,1 for example) has been neglected iately. In their 1971 paper, Manna and Waldinger8 covered one of the main reasons why-the difficulty of synthesizing program loops within the current state of the art of automatic theorem-proving.· However, there is a great deal of continuing work in theorem-proving, and it is important...

Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis

Automatic Program Synthesis from Example Problems

Desired algorithms to be synthesized are described implicitly by example problems that the algorithms should solve. The example problems are first solved by the problem-solver LAWALY. The obtained solution represents a trace of the desired algorithm. From the trace, the algorithm is synthesized by the synthesizer SYN. SYN writes recur-sive programs with repeat statements, and generates its own ...

Automatic Program Synthesis in Second-Order Logic

Abetract A resolution-based theorem prover, incorporating a restricted higher-order unification algorithm , has been applied to the automatic synthesis of SN0B0L-4 programs. The set of premisses includes second-order assignment and iteration axioms derived from those of Hoare. Two examples are given of the synthesis of programs that compute elementary functions. Descriptive Terms Higher-order l...